Position-based multicast routing for mobile Ad-hoc networks
نویسندگان
چکیده
منابع مشابه
Scalable Position-Based Multicast for Mobile Ad-hoc Networks
In this paper we present Scalable Position-Based Multicast (SPBM), a multicast routing protocol for ad-hoc networks. SPBM uses the geographic position of nodes to provide a highly scalable group membership scheme and to forward data packets with a very low overhead. SPBM bases its multicast forwarding decision on whether there are group members located in a given direction or not, allowing for ...
متن کاملLocation-Based Multicast Routing Protocol for Mobile Ad Hoc Networks
Wireless network offers freedom moving around the effective transmission area and the flexibility and easy to use function for Internet application. Many applications of computer network involve multiple users that will rely on the ability of the network to provide multicast services. Thus, multicasting will be concerned as an essential part of Ad Hoc networks. Some of the proposed routing algo...
متن کاملSector Based Multicast Routing Algorithm for Mobile Ad-hoc Networks
Multicast routing algorithms for mobile ad-hoc networks have been extensively researched in the recent past. In this paper, we present two algorithms for dealing with multicast routing problem using the notion of virtual forces. We look at the effective force exerted on a packet and determine whether a node could be considered as a Steiner node. The nodes' location information is used to genera...
متن کاملSecure position-based routing protocol for mobile ad hoc networks
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location information to make forwarding decisions. However, there are several potential security issues for the development of position-based routing protocols. In this paper, we propose a secure geographic forwarding (SGF) mech...
متن کاملPosition-Based Cluster Routing Protocol for Mobile Ad Hoc Networks
Some of the proposed mobile ad hoc network routing algorithms require maintaining a global network state at each node. The global state is always an approximation of the current network state due to the non-negligible delay of propagating local state. The imprecision of global state information and the high storage and communication overhead make those algorithms do not scale well. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOBILE Mobile Computing and Communications Review
سال: 2003
ISSN: 1559-1662,1931-1222
DOI: 10.1145/961268.961288